Algebraic - Geometric Ideas in Discrete Optimization : An Invitation by Jesus
نویسندگان
چکیده
منابع مشابه
Algebraic and Geometric Ideas in the Theory of Discrete Optimization
This book presents recent advances in the mathematical theory of discrete optimization, particularly those supported by methods from algebraic geometry, commutative algebra, convex and discrete geometry, generating functions, and other tools normally considered outside the standard curriculum in optimization. Algebraic and Geometric Ideas in the Theory of Discrete Optimization • offers BLOCKINs...
متن کاملThe Algebraic Degree of Geometric Optimization Problems
AJ1STRACT In this paper we apply Galois theoretic algebraic methods to certain fundamental geometric optimization problems whose recognition versions are not even known to be in the class NP. In particular we show that the classic Weber problem, the Line-restricted' Weber probe lem and the 3-Dimension version of this problem are in general not solvable by radicals over the field of rationals. O...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملOn geometric discretization of elasticity
This paper presents a geometric discretization of elasticity when the ambient space is Euclidean. This theory is built on ideas from algebraic topology, exterior calculus, and the recent developments of discrete exterior calculus. We first review some geometric ideas in continuum mechanics and show how constitutive equations of linearized elasticity, similar to those of electromagnetism, can be...
متن کاملOptimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation
We develop algorithms to construct inner approximations of the cone of positive semidefinite matrices via linear programming and second order cone programming. Starting with an initial linear algebraic approximation suggested recently by Ahmadi and Majumdar, we describe an iterative process through which our approximation is improved at every step. This is done using ideas from column generatio...
متن کامل